منابع مشابه
On Chromaticity of Wheels
Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if ...
متن کاملThe chromaticity of wheels with a missing spoke II
In the previous paper, it was shown that the graph U. ÷ 1 obtained from the wheel W n ÷ 1 by deleting a spoke is uniquely determined by its chromatic polynomial if n >i 3 is odd. In this paper, we show that the result is also true for even n >~ 4 except when n = 6 in which case, the graph W given in the paper is the only graph having the same chromatic polynomial as that of U 7. The relevant to...
متن کاملThe Chromaticity of Microlensing
Gravitational microlensing is not achromatic when the star being microlensed is resolved by the lens. We show how narrow-band photometry and moderateto high-resolution spectroscopy can be used to reconstruct the stellar surface intensity distribution of a microlensed star. Such microlens imaging can provide a unique opportunity to study the surfaces of normal red giants where Doppler imaging is...
متن کاملCyclins: wheels within wheels.
Cycimns were originally defined as proteins which are synthesized in each cell cycle and destroyed at every mitosis. Cyclins were discovered by T. Hunt and students at the Marine Biological Laboratory, Woods Hole, MA, duningthe 1982 Physiology Course (1). They labeled eggs ofthe sea urchin Arbacia punctulata with [35S]methionine after fertilization and analyzed the temporal pattern of protein s...
متن کاملOn chromaticity of hypergraphs
Let H = (X,E) be a simple hypergraph and let f (H, ) denote its chromatic polynomial. Two hypergraphs H1 and H2 are chromatic equivalent if f (H1, ) = f (H2, ). The equivalence class of H is denoted by 〈H 〉. Let K and H be two classes of hypergraphs.H is said to be chromatically characterized in K if for every H ∈ H ∩K we have 〈H 〉 ∩K=H ∩K. In this paper we prove that uniform hypertrees and uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90072-4